Quantum Interference Crossover-Based Clonal Selection Algorithm and Its Application to Traveling Salesman Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Clonal Algorithm and Its Application to Traveling Salesman Problem

To explain the essential features such as sufficient diversity, discrimination of self and non-self, and also long-lasting immunologic memory of adaptive immune responses, Burnet and Talmage developed the clonal selection theory. In their model, only the high affinity immune cells are selected to proliferate. Those cells with low affinity must be efficiently deleted or be set as inactive. Howev...

متن کامل

Dynamic Quantum Crossover Based Clonal Selection Algorithm For Solving Traveling Salesman Problem

The applications of Clonal Selection Algorithms (CSAs) in solving combinatorial problems are frequently faced with a premature convergence problem and the maturation processes are trapped into a local optimum. This premature convergence problem occurs when the population of a clonal selection algorithm reaches a suboptimal state that the immune operators can no longer produce new immune cells w...

متن کامل

A Probabilistic Modeling Clonal Selection Algorithm and Its Application to Traveling Salesman Problems

In this paper, we propose a probabilistic modeling clonal selection algorithm which combines the clonal selection algorithm (CSA) and the probabilistic modeling (PM) for traveling salesman problem (TSP). The clonal selection algorithm is employed by the natural immune system to define the basic features of an immune response to an antigenic stimulus, can initialize antibodies and maintain the p...

متن کامل

AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM

Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

متن کامل

Self-Crossover and Its Application to the Travelling Salesman Problem

Crossover is an important genetic operation that helps in random recombination of structured information to locate new points in the search space, in order to achieve a good solution to an optimization problem. The conventional crossover operation when applied on a pair of binary strings will usually not retain the total number of 1’s in the offsprings to be the same as that of their parents. B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2009

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.e92.d.78